Dynamic Programming for Minimum Steiner Trees

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximations for Steiner Trees with Minimum Number of Steiner Points

Given n terminals in the Euclidean plane and a positive constant, find a Steiner tree interconnecting all terminals with the minimum number of Steiner points such that the Euclidean length of each edge is no more than the given positive constant. This problem is NP-hard with applications in VLSI design, WDM optical networks and wireless communications. In this paper, we show that (a) the Steine...

متن کامل

Approximating Minimum Steiner Point Trees in Minkowski

Given a set of points, we define a minimum Steiner point tree to be a tree interconnecting these points and possibly some additional points such that the length of every edge is at most 1 and the number of additional points is minimized. We propose using Steiner minimal trees to approximate minimum Steiner point trees. It is shown that in arbitrary metric spaces this gives a performance differe...

متن کامل

Minimum Steiner Trees in Normed Planes

A minimum Steiner tree for a given set X of points is a network interconnecting the points of X having minimum possible total length. In this note we investigate various properties of minimum Steiner trees in normed planes, i.e., where the "unit disk" is an arbitrary compact convex centrally symmetric domain D having nonempty interior. We show that if the boundary of D is strictly convex and di...

متن کامل

A faster dynamic programming algorithm for exact rectilinear Steiner minimal trees

An exact rectilinear Steiner minimal tree algorithm is presented that improves upon the time and space complexity of previous guarantees and is easy to implement. Experimental evidence is presented that demonstrates that the algorithm also works well an practice.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theory of Computing Systems

سال: 2007

ISSN: 1432-4350,1433-0490

DOI: 10.1007/s00224-007-1324-4